An improved local search algorithm for 3-SAT
نویسندگان
چکیده
منابع مشابه
An Improved Local Search Algorithm for 3-SAT
We slightly improve the pruning technique presented in Dantsin et. al. (2002) to obtain an O∗ (1.473n) algorithm for 3-SAT.
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملA local search algorithm for SAT
We present a fairly simple and natural algorithm for SAT which can be viewed as a particular instantiation of the well known k opt heuristic We prove that for most formulas drawn from certain random and semi random distributions on satis able formulas the algorithm nds a satisfying assignment in polynomial time
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملAnother proof for an upper bound of a local search algorithm for 3 - SAT
We present another proof for an upper bound of a deterministic local search algorithm [3] for 3-SAT. This bound O(1.481n) is currently no longer the best (where n is the number of variables) while the best bound is slightly better: O(1.473n) due to [1].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2004
ISSN: 1571-0653
DOI: 10.1016/j.endm.2004.03.021